COCI/2010-2011/Contest #1 - 22.10.2010/x3/bruteforce.cpp

   1 // Andrés Mejía
   2 using namespace std;
   3 #include <algorithm>
   4 #include <iostream>
   5 #include <iterator>
   6 #include <numeric>
   7 #include <sstream>
   8 #include <fstream>
   9 #include <cassert>
  10 #include <climits>
  11 #include <cstdlib>
  12 #include <cstring>
  13 #include <string>
  14 #include <cstdio>
  15 #include <vector>
  16 #include <cmath>
  17 #include <queue>
  18 #include <deque>
  19 #include <stack>
  20 #include <list>
  21 #include <map>
  22 #include <set>
  23
  24 #define foreach(x, v) for (typeof (v).begin() x=(v).begin(); x !=(v).end(); ++x)
  25 #define For(i, a, b) for (int i=(a); i<(b); ++i)
  26 #define D(x) cout << #x " is " << x << endl
  27
  28 const double EPS = 1e-9;
  29 int cmp(double x, double y = 0, double tol = EPS) {
  30     return (x <= y + tol) ? (x + tol < y) ? -1 : 0 : 1;
  31 }
  32
  33 int main(){
  34     int n; cin >> n;
  35     vector<unsigned int> v(n);
  36     for (int i = 0; i < n; ++i) {
  37         cin >> v[i];
  38     }
  39     long long ans = 0;
  40     for (int i = 0; i < n; ++i) {
  41         for (int j = i + 1; j < n; ++j) {
  42             ans += v[i] ^ v[j];
  43         }
  44     }
  45     cout << ans << endl;
  46     return 0;
  47 }